Weighted LCS
نویسندگان
چکیده
منابع مشابه
Polynomial-Time Approximation Algorithms for Weighted LCS Problem
We deal with a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A (biological) weighted sequence determines the probability for each symbol to occur at a given position of the sequence (such sequences are also called Position Weighted Matrices, PWM). Two possible such versions of the problem were proposed by (Amir et al., 2009 and 2010), they are called...
متن کاملGeneralized LCS
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to devise a similar measure for comparing higher dimensional objects, and more complex structures. In this paper we study the Longest Common Substructure of two matrices and show that this problem is NP-hard. We also study t...
متن کاملRestricted LCS
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the common subsequence must contain one or more constraint strings as subsequences, the problem becomes the Constrained LCS (CLCS) problem. In this paper we consider the Restricted LCS (RLCS) problem, where our goal is f...
متن کاملNew Efficient Algorithms for LCS and Constrained LCS Problem
In this paper, we study the classic and well-studied longest common subsequence (LCS) problem and a recent variant of it namely constrained LCS (CLCS) problem. In CLCS, the computed LCS must also be a supersequence of a third given string. In this paper, we first present an efficient algorithm for the traditional LCS problem that runs in O(R log log n + n) time, where R is the total number of o...
متن کاملApproximability of Constrained LCS
Given two input sequences A 1 and A 2 and one constraint sequence B, C-LCS is the problem of finding a longest common subsequence C of A 1 and A 2 that is also a supersequence of B: A 1 = cgagggt A 2 = cgggagt B = cat C = cgagt Constrained Longest Commmon Subsequence is a natural extension to the classical problem Longest Common Subsequence, and has application to computing the homology of two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2010
ISSN: 1570-8667
DOI: 10.1016/j.jda.2010.02.001